Finite Automaton

См. также в других словарях:

• finite automaton — baigtinis automatas statusas T sritis automatika atitikmenys: angl. finite automaton; finite state machine vok. endlicher Automat, m; Finalautomat, m rus. конечный автомат, m pranc. automate final, m; automate fini, m; automate terminal, m;… …   Automatikos terminų žodynas

• finite automaton — baigtinis automatas statusas T sritis informatika apibrėžtis ↑Automatas (2), kurio būsenų skaičius baigtinis. Labiausiai naudojami automatai (palyginti su nebaigtiniais). Egzistuoja mokslo šaka, vadinama baigtinių automatų teorija. Dažnai jų… …   Enciklopedinis kompiuterijos žodynas

• Alternating finite automaton — In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal transitions. For example, let A be an alternating automaton.* For an existential… …   Wikipedia

• Two-way deterministic finite automaton — In computer science, a two way deterministic finite automaton (2DFA) is an abstract machine, a generalized version of the deterministic finite automaton (DFA) which can revisit characters already processed. As in a DFA, there are a finite number… …   Wikipedia

• Finite — is the opposite of infinite. It may refer to:* Having a finite number of elements: finite set * Being a finite number, so not equal to pminfty; all real numbers are finite * In a stronger sense, being a value that is neither infinite nor… …   Wikipedia

• Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… …   Wikipedia

• Finite state transducer — A finite state transducer (FST) is a finite state machine with two tapes: an input tape and an output tape. This contrasts with an ordinary finite state automaton (or finite state acceptor), which has a single tape. OverviewAn automaton can be… …   Wikipedia

• Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… …   Wikipedia

• automaton — noun /ɔːˈtɒmətən,ɔːˈtɒməˌtɒn/ a) A machine or robot designed to follow a precise sequence of instructions. Due to her strict adherence to her daily schedule, Jessica was becoming more and more convinced that she was an automaton. b) A formal… …   Wiktionary

• finite state machine — baigtinis automatas statusas T sritis automatika atitikmenys: angl. finite automaton; finite state machine vok. endlicher Automat, m; Finalautomat, m rus. конечный автомат, m pranc. automate final, m; automate fini, m; automate terminal, m;… …   Automatikos terminų žodynas

• Automaton (disambiguation) — Automaton may refer to:* Automaton, a self operating machine * Automaton , a song by London s Neo New Wave Band The Rakes * An automaton, a mathematical model for a finite state machine (see automata theory) …   Wikipedia